Sudokus and Gröbner Bases: Not Only a Divertimento
نویسندگان
چکیده
Sudoku is a logic-based placement puzzle. We recall how to translate this puzzle into a 9-colouring problem which is equivalent to a (big) algebraic system of polynomial equations. We study how far Gröbner bases techniques can be used to treat these systems produced by Sudokus. This general purpose tool can not be considered as a good solver, but we show that it can be useful to provide information on systems that are —in spite of their origin— hard to solve.
منابع مشابه
Linear Algebraic Approach to H-basis Computation
Macaulay introduced the notion of H-bases [2]. His original motivation was the transformation of systems of polynomial equations into simpler ones. The power of this concept was not really understood presumably because of the lack of facilities for symbolic computations. Later Buchberger invented Gröbner bases for computing multiplication tables for factor rings [1]. When Computer Algebra Syste...
متن کاملValue Monoids of Zero-dimensional Valuations of Rank One
Classically, Gröbner bases are computed by first prescribing a fixed monomial order. Moss Sweedler suggested an alternative in the mid 1980s and developed a framework to perform such computations by using valuation rings in place of monomial orders. We build on these ideas by providing a class of valuations on K(x, y) that are suitable for this framework. We then perform such computations for i...
متن کاملSAGBI Bases Under Composition
Our interest in the subject of this paper is inspired by Hong (1998), where Hoon Hong addresses the problem of the behavior of Gröbner bases under composition of polynomials. More precisely, let Θ be a set of polynomials, as many as the variables in our polynomial ring. The question then is under which conditions on these polynomials it is true that for an arbitrary Gröbner basis G (with respec...
متن کاملGeneralized Discrete Comprehensive Gröbner Bases
We showed special types of comprehensive Gröbner bases can be defined and calculated as the applications of Gröbner bases in polynomial rings over commutative Von Neumann regular rings in [5] and [6]. We called them discrete comprehensive Gröbner bases, since there is a strict restriction on specialization of parameters, that is parameters can take values only 0 and 1. In this paper, we show th...
متن کاملComprehensive Gröbner bases and von Neumann regular rings
There is a close relation between comprehensive Gröbner bases and non-parametric Gröbner bases over commutative von Neumann regular rings. By this relation, Gröbner bases over a commutative von Neumann regular ring can be viewed as an alternative to comprehensive Gröbner bases. (Therefore, this Gröbner basis is called an “alternative comprehensive Gröbner basis (ACGB)”.) In the first part of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006